Super-simple (v, 5, 2)-designs
نویسندگان
چکیده
In this paper we study the spectrum of super–simple (v, 5, 2)– designs. We show that a super–simple (v, 5, 2)–design exists if and only if v ≡ 1 or 5 (mod 10), v 6= 5, 15, except possibly when v ∈ {75, 95, 115, 135, 195, 215, 231, 285, 365, 385, 515}.
منابع مشابه
Super-simple (v, 5, 4) designs
Super-simple designs are useful in constructing codes and designs such as superimposed codes and perfect hash families. Recently, Gronau et al determined the existence of super-simple (v, 5, 2)-BIBDs with possible exceptions of v ∈ {75, 95, 115, 135, 195, 215, 231, 285, 365, 385, 515}. In this article, we investigate the existence of a super-simple (v, 5, 4)-BIBD and show that such a design exi...
متن کاملSuper-simple 2-(v, 5, 1) directed designs and their smallest defining sets
In this paper we investigate the spectrum of super-simple 2-(v, 5, 1) directed designs (or simply super-simple 2-(v, 5, 1)DDs) and also the size of their smallest defining sets. We show that for all v ≡ 1, 5 (mod 10) except v = 5, 15 there exists a super-simple (v, 5, 1)DD. Also for these parameters, except possibly v = 11, 91, there exists a super-simple 2-(v, 5, 1)DD whose smallest defining s...
متن کاملSuper-simple balanced incomplete block designs with block size 4 and index 5
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in other constructions, such as superimposed codes and perfect hash families etc. The existence of super-simple (v, 4, λ)-BIBDs have been determined for λ = 2, 3, 4 and 6. When λ = 5, the necessary conditions of such a d...
متن کاملSuper-simple balanced incomplete block designs with block size 5 and index 3
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in constructing codes and designs such as superimposed codes and perfect hash families. The existence of super-simple (v, 4, λ)BIBDs have been determined for λ = 2, 3, 4, 5, 6. In this paper, we investigate the existence...
متن کاملVarious super-simple designs with block size four
In this note the existence of a (Vj P2j 4, 2) BTD I for P2 = 0, 1 and 2, in which any pair of blocks intersect in at most two elements, is proved for any admissible v. A balanced ternary design is a collection of multi-sets of size k, chosen from a v-set in such a way that each element occurs 0, 1 or 2 times in anyone block, each pair of non-distinct elements, {x, x}, occurs in P2 blocks of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 138 شماره
صفحات -
تاریخ انتشار 2004